Shadows of Cube Vertices

Soft bilateral filtering volumetric shadows using cube shadow maps

Volumetric shadows often increase the realism of rendered scenes in computer graphics. Typical volumetric shadows techniques do not provide a smooth transition effect in real-time with conservation on crispness of boundaries. This research presents a new technique for generating high quality volumetric shadows by sampling and interpolation. Contrary to conventional ray marching method, which re...

Hemi-Cube Ray-Tracing: A Method for Generating Soft Shadows

This paper presents a new ray-tracing technique for generating soft shadows. The technique treats scenes consisting of light sources and opaque objects which are polygons or polyhedra of arbitrary shape and size. To determine the intensity at a point on a surface, the hemisphere is sampled extensively through the use of hemi-cubes. So-called item-buffer boxes, a combination of itembuffers and b...

Induction The dance of shadows

Statistics stems out from induction. Induction is a long lasting notion in philosophy. The nature of notions in philosophy are such that neither they can be solved completely nor one can leave them forever. One of the most important problem in induction is “the problem of induction”. In this paper we give a short history of induction and discuss some aspects of the problem of induction.  

n - Cube network : node disjoint shortest paths for maximal distance pairs of vertices q

In parallel and distributed systems many communications take place concurrently, so the routing algorithm as well as the underlying interconnection network play a vital role in delivering all the messages efficiently. Fault tolerance and performance are often obtained by delivering the messages through node disjoint shortest paths. In this paper we present two efficient algorithms to construct,...

n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices